An Improved PSO Algorithm Based on Mutation Operator and Simulated Annealing
نویسندگان
چکیده
منابع مشابه
An Improved PSO Algorithm Based on Mutation Operator and Simulated Annealing
Particle swarm optimization (PSO) algorithm is simple stochastic global optimization technique, but it exists unbalanced global and local search ability, slow convergence speed and solving accuracy. An improved simulated annealing (ISAM) algorithm is introduced into the PSO algorithm with crossover and Gauss mutation to propose an improved PSO (ISAMPSO) algorithm based on the mutation operator ...
متن کاملAn improved PSO-based ANN with simulated annealing technique
This paper presents a modified particle swarm optimization (PSO) with simulated annealing (SA) technique. An improved PSO-based artificial neural network (ANN) is developed. The results show that the proposed SAPSO-based ANN has a better ability to escape from a local optimum and is more effective than the conventional PSO-based ANN. r 2004 Elsevier B.V. All rights reserved.
متن کاملOn Performance Analysis of Hybrid Algorithm (Improved PSO with Simulated Annealing) with GA, PSO for Multiprocessor Job Scheduling
Particle Swarm Optimization is currently employed in several optimization and search problems due its ease and ability to find solutions successfully. A variant of PSO, called as Improved PSO has been developed in this paper and is hybridized with the simulated annealing approach to achieve better solutions. The hybrid technique has been employed, inorder to improve the performance of improved ...
متن کاملAn improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the bandwidth minimization problem for graphs. This algorithm is based on three distinguished features including an original internal representation of solutions, a highly discriminating evaluation function and an effective neighborhood. The algorithm is evaluated on a set of 113 well-known benchmark instances of the literature and...
متن کاملAn Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Then the paper introduces the simulated annealing (SA) algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Multimedia and Ubiquitous Engineering
سال: 2015
ISSN: 1975-0080
DOI: 10.14257/ijmue.2015.10.10.36